Approximating connectivity augmentation problems
نویسندگان
چکیده
منابع مشابه
Approximating Minimum Cost Connectivity Orientation and Augmentation
Connectivity augmentation and orientation are two fundamental classes of problems related to graph connectivity. The former includes minimum cost spanning trees, k-edge-connected subgraph and more generally, survivable network design problems [9]. In the orientation problems the goal is to find orientations of an undirected graph that achieve prescribed connectivity properties such as global an...
متن کاملEdge-Connectivity Augmentation Problems
The problem in which the object is to add a minimum weight set of edges to a graph so as to satisfy a given condition is called the augmentation problem. This problem has a wide variety [3-5, 10, 11, 14-201. If such a given condition is concerned with the vertexor edge-connectivity of a graph then the problem is referred to as the (vertexor edge-) connectivity augmentation problem. Frank and Ch...
متن کاملApproximating minimum cost connectivity problems
We survey approximation algorithms and hardness results for versions of the Generalized Steiner Network (GSN) problem in which we seek to find a low cost subgraph (where the cost of a subgraph is the sum of the costs of its edges) that satisfies prescribed connectivity requirements. These problems include the following well known problems: min-cost k-flow, min-cost spanning tree, traveling sale...
متن کاملApproximating Subset k-Connectivity Problems
A subset T ⊆ V of terminals is k-connected to a root s in a directed/undirected graph J if J has k internally-disjoint vs-paths for every v ∈ T ; T is k-connected in J if T is k-connected to every s ∈ T . We consider the Subset k-Connectivity Augmentation problem: given a graph G = (V,E) with edge/node-costs, node subset T ⊆ V , and a subgraph J = (V,EJ ) of G such that T is k-connected in J , ...
متن کاملMatching Based Augmentations for Approximating Connectivity Problems
We describe a very simple idea for designing approximation algorithms for connectivity problems: For a spanning tree problem, the idea is to start with the empty set of edges, and add matching paths between pairs of components in the current graph that have desirable properties in terms of the objective function of the spanning tree problem being solved. Such matching augment the solution by re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2009
ISSN: 1549-6325,1549-6333
DOI: 10.1145/1644015.1644020